Eigenvalue distribution of optimal transportation
نویسندگان
چکیده
منابع مشابه
The ∞-eigenvalue Problem and a Problem of Optimal Transportation
ABSTRACT. The so-called eigenvalues and eigenfunctions of the infinite Laplacian ∆∞ are defined through an asymptotic study of that of the usual p-Laplacian ∆p, this brings to a characterization via a non-linear eigenvalue problem for a PDE satisfied in the viscosity sense. In this paper, we obtain an other characterization of the first eigenvalue via a problem of optimal transportation, and re...
متن کاملJoint distribution optimal transportation for domain adaptation
This paper deals with the unsupervised domain adaptation problem, where one wants to estimate aprediction function f in a given target domain without any labeled sample by exploiting the knowledgeavailable from a source domain where labels are known. Our work makes the following assumption: thereexists a non-linear transformation between the joint feature/label space distributio...
متن کاملOptimal length transportation hypothesis to model proteasome product size distribution.
This paper discusses translocation features of the 20S proteasome in order to explain typical proteasome length distributions. We assume that the protein transport depends significantly on the fragment length with some optimal length which is transported most efficiently. By means of a simple one-channel model, we show that this hypothesis can explain both the one- and the three-peak length dis...
متن کاملOptimal location of transportation devices
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which the travel speed is high. More specifically, one can travel from one endpoint of the walkway to the other at speed v > 1, but can only travel at unit speed between any other pair of points. The travel time between any...
متن کاملThe geometry of optimal transportation
A classical problem of transporting mass due to Monge and Kantorovich is solved. Given measures μ and ν on Rd, we find the measure-preserving map y(x) between them with minimal cost — where cost is measured against h(x − y) with h strictly convex, or a strictly concave function of |x − y|. This map is unique: it is characterized by the formula y(x) = x − (∇h)−1(∇ψ(x)) and geometrical restrictio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Analysis & PDE
سال: 2015
ISSN: 1948-206X,2157-5045
DOI: 10.2140/apde.2015.8.33